Strong and weak points of the MUSCADET theorem prover - examples from CASC-JC
نویسنده
چکیده
MUSCADET is a knowledge-based theorem prover based on natural deduction. It has participated in CADE Automated theorem proving System Competitions. The results show its complementarity with regard to resolution-based provers. This paper presents some of its crucial methods and gives some examples of MUSCADET proofs from the last competition (CASC-JC in IJCAR 2001).
منابع مشابه
Natural Proof Search and Proof Writing
Muscadet is a knowledge-based theorem prover based on natural deduction. Its results show its complementarity with regard to resolution-based provers. This paper presents some Muscadet results and points out some of its characteristics.
متن کاملMathematical Theorem Proving, from Muscadet0 to Muscadet4, Why and How
This paper presents the ideas and the choices which have been made throughout the development of the Muscadet theorem prover. We will first see the principles and main ideas which lead to a first prover in the context of the time, influenced by a famous paper by Woody Bledsoe. This program used natural methods and was applied to set theory. It was then rewritten as a knowledge based-system wher...
متن کامل?-Independent and Dissociate Sets on Compact Commutative Strong Hypergroups
In this paper we define ?-independent (a weak-version of independence), Kronecker and dissociate sets on hypergroups and study their properties and relationships among them and some other thin sets such as independent and Sidon sets. These sets have the lacunarity or thinness property and are very useful indeed. For example Varopoulos used the Kronecker sets to prove the Malliavin theorem. In t...
متن کاملA New Common Fixed Point Theorem for Suzuki Type Contractions via Generalized $Psi$-simulation Functions
In this paper, a new stratification of mappings, which is called $Psi$-simulation functions, is introduced to enhance the study of the Suzuki type weak-contractions. Some well-known results in weak-contractions fixed point theory are generalized by our researches. The methods have been appeared in proving the main results are new and different from the usual methods. Some suitable examples ar...
متن کاملE-MaLeS 1.1
Picking the right search strategy is important for the success of automatic theorem provers. E-MaLeS is a meta-system that uses machine learning and strategy scheduling to optimize the performance of the first-order theorem prover E. E-MaLeS applies a kernel-based learning method to predict the run-time of a strategy on a given problem and dynamically constructs a schedule of multiple promising...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- AI Commun.
دوره 15 شماره
صفحات -
تاریخ انتشار 2002